Universal Geometric Algebra
نویسنده
چکیده
Alfred North Whitehead promoted the idea of UNIVERSAL ALGEBRA in his monumental treatise of 1897 [1]. He proposed two candidates for this lofty title, the algebra of Boole and Grassmann’s Algebra of Extension. Boolean algebra has since secured universality status in Set Theory and Symbolic Logic, although only the former is universally known and used by mathematicians. However, Whitehead’s work on Grassmann Algebra, which ironically is much the larger portion of his treatise, has been almost totally ignored. Grassmann algebra has been making a comeback among mathematicians in recent decades, primarily in the guise of differential forms. But this has involved only the half of Grassmann’s algebra generated by his progressive product, while his regressive product remains unappreciated along with Whitehead’s elaborate treatment of it. Of course, the regressive product was designed to perform an important mathematical function which must be handled by other means in modern mathematics. As Gian-Carlo Rota and coworkers ([2],[3]) have vigorously argued, the result has been a step backward in conceptual clarity and computational efficiency. I agree that the regressive product should be revived, but I wish to go further. I claim that Grassmann and Whitehead were just one step away from a mathematical system that truly deserves to be regarded as a UNIVERSAL GEOMETRIC ALGEBRA. That system is known in mathematics as Clifford algebra. However, the true universality of Clifford algebra has remained unrecognized, even by mathematicans specializing in the subject. The main reason, I suppose, is that the demonstration of universality requires a wholescale reorganization and redesign of mathematics, integrating into a single mathematical system such superficially disparate systems as quaternion calculus, differential forms
منابع مشابه
A case study in geometric algebra : Fitting roommodels to 3 D point clouds Author : Moos
Many geometrical problems exist which have been researched thoroughly, but always using classical methods such as linear algebra as a framework for the problem. As linear algebra is an algebra based on coordinates and numbers as basic elements of computation, this leads to longwinded and non-universal code. Geometric algebra is an alternative formalism in which geometric objects are the basic e...
متن کاملWhat can Grassmann, Hamilton and Clifford tell us about Computer Vision and Robotics
Geometric algebra is a universal mathematical language which provides very comprehensive techniques for analyzing the complex geometric situations occurring in robotics and computer vision. The application of the 4D motor algebra for the linearization of the the hand-eye calibration problem is presented. Geometric algebra and its associated linear algebra framework is a very elegant language to...
متن کاملRealizing Enveloping Algebras via Varieties of Modules
By using the Ringel-Hall algebra approach, we investigate the structure of the Lie algebra L(Λ) generated by indecomposable constructible sets in the varieties of modules for any finite dimensional Calgebra Λ. We obtain a geometric realization of the universal enveloping algebra R(Λ) of L(Λ). This generalizes the main result of Riedtmann in [19]. We also obtain Green’s theorem in [6] in a geome...
متن کاملA Unified Language for Computer Vision and Robotics
Geometric algebra is an universal mathematical language which provides very comprehensive techniques for analyzing the complex geometric situations occurring in artiicial Perception Action Cycle systems. In the geometric algebra framework such a system is both easier to analyze and to control in real time computations. This paper describes the application of rotors and motors for tasks involvin...
متن کاملIncidence Constraints: a Combinatorial Approach
The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed; they use strictly no computer algebra but only combina...
متن کامل